Parallel relaxed and extrapolated algorithms for computing PageRank
نویسندگان
چکیده
منابع مشابه
Scalable Computing for Power Law Graphs: Experience with Parallel PageRank
In this paper we report on the behavior of parallel numerical algorithms applied to computing the PageRank vector for a 1.5 billion node directed webgraph. We also describe the details of our parallel implementation that was able to compute the PageRank vector for this webgraph on a distributed memory 140 processor RLX cluster in under 6 minutes. Historically, much of the work in parallel compu...
متن کاملParallel Computing Algorithms and Applications
I n high-performance computing , there's often a wide chasm between low-level concepts such as memory bandwidth, cache-coherence, and nonuniform memory access, and their relevance to real-world applications, such as solving an elliptic partial differential equation with millions of degrees of freedom using a multigrid iterative solver. Scientific Parallel Computing is a commendable attempt at b...
متن کاملMobile Computing: Opportunities for Parallel Algorithms Research
The last thirty years have seen trmendous growth in research in mobile telemcommunications. However, interest in mobile computing, which includes mobile telephony and more, has increased over the last ten years. Nevertheless, most of the research on mobile computing addresses the “engineering” issues and the electronic componentary required for building mobile systems. On the other hand, algori...
متن کاملParallel Algorithms for Computing Temporal Aggregates
The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and response time requirements has outpaced advancements in processor and mass storage technology, leading to the need for parallel temporal database management systems. In this paper, we introduce a variety of parallel temporal aggregation algorithms for a sharednot...
متن کاملParallel Algorithms for Computing Linked List Prefix
Given a linked list x1, x2, ..., xn with xi following xi−1 in the list and an associative operation ©, the linked list prefix problem is to compute all prefixes ©ji=1xi, j = 1, 2, ..., n. In this paper we study the linked list prefix problem on parallel computation models. A deterministic algorithm for computing a linked list prefix on a completely connected parallel computation model is obtain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2014
ISSN: 0920-8542,1573-0484
DOI: 10.1007/s11227-014-1118-9